Markov selection for constrained martingale problems
نویسندگان
چکیده
منابع مشابه
Martingale Problems for Large Deviations of Markov Processes
The martingale problems provide a powerful tool for characterizing Markov processes, especially in addressing convergence issues. For each n, let metric space E-valued process X n be a solution of the A n martingale problems (i.e. f (X n (t)) ? f (X n (0)) ? Z t 0 A n f (X n (s))ds is a martingale), the convergence of A n f ! Af in some sense usually implies the weak convergence of X n) X , whe...
متن کاملMartingale problems for conditional distributions of Markov processes
Let X be a Markov process with generator A and let Y (t) = γ(X(t)). The conditional distribution πt of X(t) given σ(Y (s) : s ≤ t) is characterized as a solution of a filtered martingale problem. As a consequence, we obtain a generator/martingale problem version of a result of Rogers and Pitman on Markov functions. Applications include uniqueness of filtering equations, exchangeability of the s...
متن کاملOn characterisation of Markov processes via martingale problems
Abstract. It is well-known that well-posedness of a martingale problem in the class of continuous (or r.c.l.l.) solutions enables one to construct the associated transition probability functions. We extend this result to the case when the martingale problem is well-posed in the class of solutions which are continuous in probability. This extension is used to improve on a criterion for a probabi...
متن کاملDenumerable Constrained Markov Decision Problems and Finite Approximations Denumerable Constrained Markov Decision Problems and Finite Approximations
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Processes with a countable state and action spaces with general multi-chain structure. Second, to introduce nite approximation methods. We deene the occupation measures and obtain properties of the set of all achievable occupation measures under the diierent admissible policies. We est...
متن کاملNewton methods for k-order Markov Constrained Motion Problems
This is a documentation of a framework for robotmotion optimization that aims to draw on classical constrained optimization methods. With one exception the underlying algorithms are classical ones: Gauss-Newton (with adaptive stepsize and damping), Augmented Lagrangian, log-barrier, etc. The exception is a novel any-time version of the Augmented Lagrangian. The contribution of this framework is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2019
ISSN: 1083-6489
DOI: 10.1214/19-ejp393